Game-Theoretic Semantics for Alternating-Time Temporal Logic

نویسندگان

  • Valentin Goranko
  • Antti Kuusisto
  • Raine Rönnholm
چکیده

We introduce versions of game-theoretic semantics (GTS) for Alternating-Time Temporal Logic (ATL). In GTS, truth is defined in terms of existence of a winning strategy in a semantic evaluation game, and thus the game-theoretic perspective appears in the framework of ATL on two semantic levels: on the object level, in the standard semantics of the strategic operators, and on the meta-level, where game-theoretic logical semantics can be applied to ATL. We unify these two perspectives into semantic evaluation games specially designed for ATL. The novel game-theoretic perspective enables us to identify new variants of the semantics of ATL, based on limiting the time resources available to the verifier and falsifier in the semantic evaluation game; we introduce and analyse an unbounded and bounded GTS and prove these to be equivalent to the standard (Tarski-style) compositional semantics. We also introduce a non-equivalent finitely bounded semantics and argue that it is natural from both logical and game-theoretic perspectives.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Game-Theoretic Semantics for ATL+ with Applications to Model Checking

We develop a game-theoretic semantics (GTS) for the fragment ATL of the Alternating-time Temporal Logic ATL∗, essentially extending a recently introduced GTS for ATL. We show that the new game-theoretic semantics is equivalent to the standard compositional semantics of ATL (with perfectrecall strategies). Based on the new semantics, we provide an analysis of the memory and time resources needed...

متن کامل

Game Theory and Logic for Non-repudiation Protocols and Attack Analysis

We develop a game-based protocol semantics, by modeling protocols as concurrent game structures. To be precise, we take protocol specifications from the Cremers–Mauw protocol semantics, and interpret such protocol specifications in concurrent game structures instead of in labeled transition systems. This allows us to define security properties on Cremers–Mauw protocol specifications in logics o...

متن کامل

Comparing Semantics of Logics for Multi-Agent Systems

We draw parallels between several closely related logics that combine – in different proportions – elements of game theory, computation tree logics, and epistemic logics to reason about agents and their abilities. These are: the coalition game logics CL and ECL introduced by Pauly in 2000, the alternating-time temporal logic ATL developed by Alur, Henzinger and Kupferman between 1997 and 2002, ...

متن کامل

Coalition Games and Alternating Temporal Logics

We draw parallels between coalition game logics developed in [Pauly, 2000b], [Pauly, 2000c], and [Pauly, 2001] on one hand, and alternating-time temporal logics of computations introduced in [Alur et al, 97] on the other. In particular, we show equivalence of their semantics, embedding of coalition game logics into alternating-time temporal logic, and propose axiomatic systems for these logics.

متن کامل

Reasoning about Natural Strategic Ability

In game theory, as well as in the semantics of game logics, a strategy can be represented by any function from states of the game to the agent’s actions. That makes sense from the mathematical point of view, but not necessarily in the context of human behavior. This is because humans are quite bad at executing complex plans, and also rather unlikely to come up with such plans in the first place...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016